Sum of positions of records in random permutations: A precise analysis
نویسنده
چکیده
This statistic has been the object of recent interest in the litterature. Using the saddle point method, we obtain from the generating function of the sum of positions of records in random permutations and Cauchy’s integral formula, asymptotic results in central and non-central regions. In the non-central region, we derive asymptotic expansions generalizing some results by Kortchemski. In the central region, we obtain a limiting distribution related to Dickman’s function. This paper fits within the framework of Analytic Combinatorics.
منابع مشابه
Sum of Positions of Records in Random Permutations: Asymptotic Analysis
This statistic, i.e. the sum of positions of records, has been the object of recent interest in the literature. Using the saddle point method, we obtain from the generating function of the sum of positions of records in random permutations and Cauchy’s integral formula, asymptotic results in central and non-central regions. In the non-central region, we derive asymptotic expansions generalizing...
متن کاملRecords in Geometrically Distributed Words: Sum of Positions
Kortchemski introduced a new parameter for random permutations: the sum of the positions of the records. We investigate this parameter in the context of random words, where the letters are obtained by geometric probabilities. We find a relation for a bivariate generating function, from which we can obtain the expectation, exactly and asymptotically. In principle, one could get all moments from ...
متن کاملA Novel Intrusion Detection Systems based on Genetic Algorithms-suggested Features by the Means of Different Permutations of Labels’ Orders
Intrusion detection systems (IDS) by exploiting Machine learning techniques are able to diagnose attack traffics behaviors. Because of relatively large numbers of features in IDS standard benchmark dataset, like KDD CUP 99 and NSL_KDD, features selection methods play an important role. Optimization algorithms like Genetic algorithms (GA) are capable of finding near-optimum combination of the fe...
متن کاملCoherent random permutations with record statistics
157 HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm A two-parameter family of random permutations of [n] is introduced, with distribution conditionally uniform given the counts of upper and lower records. The family interpolates between two versions of Ewens' distribution. A distinguished role of the family is determined by the fact that every sequence of coherent p...
متن کاملThe Shape of Random Pattern-avoiding Permutations
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We view the permutations as 0-1 matrices to describe the resulting asymptotics geometrically. We then apply our results to obtain a number of results on distribu...
متن کامل